Search results for "Square tiling"
showing 4 items of 4 documents
Guest-dependent single-ion magnet behaviour in a cobalt(ii) metal-organic framework.
2015
Single-ion magnets (SIMs) are the smallest possible magnetic devices for potential applications in quantum computing and high-density information storage. Both, their addressing in surfaces and their organization in metal-organic frameworks (MOFs) are thus current challenges in molecular chemistry. Here we report a two-dimensional 2D MOF with a square grid topology built from cobalt(ii) SIMs as nodes and long rod-like aromatic bipyridine ligands as linkers, and exhibiting large square channels capable to host a large number of different guest molecules. The organization of the cobalt(ii) nodes in the square layers improves the magnetic properties by minimizing the intermolecular interaction…
Radio k-Labelings for Cartesian Products of Graphs
2005
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem (CVRP) in which customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. We introduce a novel symmetric formulation of the problem in which the clustering part is modeled with an asymmetric sub-model. We solve the new model with a branch-and-cut algorithm exploiting some known valid inequalities for the CVRP that can be adapted. In addition, we derive problem-specific cutting planes and new heuristic and exact separation procedures. For square grid instances in the Euclidean plane, we provide lower-bounding techniques …
Fully Bayesian Approach to Image Restoration with an Application in Biogeography
1994
SUMMARY A common method of studying biogeographical ranges is an atlas survey, in which the research area is divided into a square grid and the data consist of the squares where observations occur. Often the observations form only an incomplete map of the true range, and a method is required to decide whether the blank squares indicate true absence or merely a lack of study there. This is essentially an image restoration problem, but it has properties that make the common empirical Bayesian procedures inadequate. Most notably, the observed image is heavily degraded, causing difficulties in the estimation of spatial interaction, and the assessment of reliability of the restoration is emphasi…